Unification in lax logic
نویسندگان
چکیده
In this paper, we focus on the intuitionistic propositional logic extended with a local operator [22] (also called nucleus [21]); such is commonly named lax after [9]. We prove that unification finitary in and supply algorithms for computing basis of unifiers recognizing admissibility inference rules, following analogous known results logic.
منابع مشابه
Propositional Lax Logic Propositional Lax Logic
We investigate a peculiar intuitionistic modal logic, called Propositional Lax Logic (PLL), which has promising applications to the formal veri cation of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints | a central notion in hardware veri cation | as a logical modality. As a modal logic it is special since it features a single modal...
متن کاملQuantiied Lax Logic Quantiied Lax Logic
Lax Logic is an intuitionistic modal logic which has so far been investigated at the propositional level. It has shown itself to have applications in the formal veriication of hardware|a logical modality is used to capture and express the correctness of speciicationsùp to' behavioural constraints. A translation from Quantiied Lax Logic to a quantiied classical modal logic is presented which ena...
متن کاملProof search in Lax Logic
A Gentzen sequent calculus for Lax Logic is presented, the proofs in which naturally correspond in a 1–1 way with the normal natural deductions for the logic. The propositional fragment of this calculus is then used a basis for another calculus, one which uses a history mechanism in order to give a decision procedure for propositional Lax Logic.
متن کاملPropositional Lax Logic
We investigate a novel intuitionistic modal logic, called Propositional Lax Logic, with promising applications to the formal veri cation of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints | a central notion in hardware veri cation | as a logical modality. The resulting logic is unorthodox in several respects. As a modal logic it is...
متن کاملHierarchies in Inclusion Logic with Lax Semantics
We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level. Arity hierarchy is shown to be strict by relating the question to the stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of algebraic hyperstructures and logical algebras
سال: 2022
ISSN: ['2676-6000', '2676-6019']
DOI: https://doi.org/10.52547/hatef.jahla.3.1.6